Conditional Inequalities and the Shortest
نویسندگان
چکیده
منابع مشابه
On the Greedy Superstring Conjecture
We investigate the greedy algorithm for the shortest common superstring problem. We show that the length of the greedy superstring is upper-bounded by the sum of the lengths of an optimal superstring and an optimal cycle cover, provided the greedy algorithm happens to merge the strings in a particular way. Thus, when restricting inputs correspondingly, we verify the well known greedy conjecture...
متن کاملSet Estimation and Inference with Models Characterized by Conditional Moment Inequalities
This paper studies set estimation and inference of models characterized by conditional moment inequalities. A consistent set estimator and a con dence set are provided in this paper. Previous studies on set estimation and inference with conditional moment inequalities typically use only a nite set of moment inequalities implied by the conditional moment inequalities. We consider an alternative...
متن کاملA note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint
This note introduces an extension to the 0-1 knapsack cover inequalities to be used in a branchand-cut algorithm for the elementary shortest path problem with a capacity constraint. The extension leads to a set of valid inequalities that takes both the fractional usage of the edges and the capacity into account and are denoted the flow extended 0-1 knapsack cover inequalities. Computational exp...
متن کاملاندازهگیری غیرخطی تحرک شرطی درآمدی در ایران «کاربردی از داده‌های شبه‌ترکیبی»
One of the issues discussed in economy is the socioeconomic inequality in the society. Income mobility is another measure which indicates the degree of inequality of opportunity in a society. The extent of income mobility depends on socio-economic status of the individuals. Different socio-economic status leads to further inequality and increases inequality of opportunity. Such inequalities l...
متن کاملDo essentially conditional information inequalities
We show that two essentially conditional linear information inequalities (including the Zhang–Yeung’97 conditional inequality) do not hold for asymptotically entropic points. This result raises the question of the “physical” meaning of these inequalities and the validity of their use in practice-oriented applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004